Skolem arrays and skolem labellings of ladder graphs
نویسندگان
چکیده
منابع مشابه
Skolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملSkolem Sequences and Erdosian Labellings of m Paths with 2 and 3 Vertices
Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is a positive integer. In this paper, we discuss certain labelling of the m graphs called c-Erdösian for some positive integers c. We regard labellings of the vertices of the graphs by positive integers, which induce the edge labels for the paths as the sum of the two incident vertex labels. They h...
متن کاملSkolem labellings of generalised Dutch windmills
In this paper, we consider Skolem (vertex) labellings and present (hooked) Skolem labellings for generalised Dutch windmills whenever such labellings exist. Specifically, we show that generalised Dutch windmills with more than two cycles cannot be Skolem labelled and that those composed of two cycles of lengths m and n, n ≥ m, cannot be Skolem labelled if and only if n−m ≡ 3, 5 (mod 8) and m is...
متن کاملSkolem difference mean labeling of disconnected graphs
Let G = (V,E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices x ∈ V with distinct elements f(x) from 1, 2, 3, ..., p+ q in such a way that for each edge e = uv, let f∗(e) = l |f(u)−f(v)| 2 m and the resulting labels of the edges are distinct and are from 1, 2, 3, ..., q. A graph that admits a skolem difference mea...
متن کاملOrientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
We give a characterization of a current assignment on the bipartite Möbius ladder graph with 2n + 1 rungs. Such an assignment yields an index one current graph with current group Z12n+7 that generates an orientable face 2-colorable triangular embedding of the complete graph K12n+7 or, equivalently, an orientable biembedding of two cyclic Steiner triple systems of order 12n+7. We use our charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 63 شماره
صفحات -
تاریخ انتشار 2002